A similarity transform for linear finite state machines
نویسندگان
چکیده
منابع مشابه
Linear Speed-Up, Information Vicinity, and Finite-State Machines
Connections are shown between two properties of a machine model: linear speed-up and polynomial vicinity . In the context of the author’s Block Move (BM) model, these relate to: “How long does it take to simulate a finite transducer S on a given input z?” This question is related to the century-old problem of finding economical representations for finite groups. Under some cost measures for com...
متن کاملLearning Finite State Machines
The terms grammatical inference and grammar induction both seem to indicate that techniques aiming at building grammatical formalisms when given some information about a language are not concerned with automata or other finite state machines. This is far from true, and many of the more important results in grammatical inference rely heavily on automata formalisms, and particularly on determinis...
متن کاملFinite state machines
Finite State Machines, in short FSMs, are formalisms that have been used for decades to describe the behavior of systems. They can also provide an intelligent agent with a suitable formalism for describing its own beliefs about the behavior of the world surrounding it. In fact, FSMs are the suitable acceptors for right linear languages, which are the simplest languages considered in Chomsky’s c...
متن کاملA Parallel State Assignment Algorithm for Finite State Machines
This paper summarizes the design and implementation of a parallel algorithm for state assignment of large Finite State Machines. High performance CAD tools are necessary to overcome the computational complexity involved in the optimization of large sequential circuits. FSMs constitute an important class of logic circuits and state assignment is one of the key steps in combinational logic optimi...
متن کاملA Parallel Algorithm for State Assignment of Finite State Machines
Optimization of huge sequential circuits has become unmanageable in CAD of VLSI due to enormous time and memory requirements. In this paper, we report a parallel algorithm for the state assignment problem for nite state machines. Our algorithm has three sig-niicant contributions: It is an asynchronous parallel algorithm portable across diierent MIMD machines. Time and memory requirements reduce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2006
ISSN: 0166-218X
DOI: 10.1016/j.dam.2006.01.007